منابع مشابه
Zarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملzarankiewicz numbers and bipartite ramsey numbers
the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...
متن کاملStar-Avoiding Ramsey Numbers
The graph Ramsey number R(G,H) is the smallest integer n such that every 2-coloring of the edges of Kn contains either a red copy of G or a blue copy of H . We find the largest star that can be removed from Kn such that the underlying graph is still forced to have a red G or a blue H . Thus, we introduce the star-avoiding Ramsey number r∗(G,H) as the smallest integer k such that every 2-colorin...
متن کاملPath-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a subgraph or the complement of G contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn, K̂m), where Pn is a path on n vertices and K̂m is the graph obtained from the join of K1 and Pm. We determine the ...
متن کاملOn weighted Ramsey numbers
The weighted Ramsey number, wR(n, k), is the minimum q such that there is an assignment of nonnegative real numbers (weights) to the edges of Kn with the total sum of the weights equal to ( n 2 ) and there is a Red/Blue coloring of edges of the same Kn, such that in any complete k-vertex subgraph H, of Kn, the sum of the weights on Red edges in H is at most q and the sum of the weights on Blue ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00081-5